1285C - Fadi and LCM - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define BA ios::sync_with_stdio(false);cin.tie(0);
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define read freopen("input.txt","r",stdin) ;
#define write freopen("output.txt","w",stdout) ;

map<ll,ll> factors(ll n)
{
    map<ll,ll> m;
    for(ll i=2;i*i<=n;i++)
    {
        while(n%i==0)
        {
            m[i]++;
            n/=i;
        }
    }
    if(n>1)
        m[n]++;
    return(m);
}

bool prime(ll n)
{
    bool b;
    if(n<2)
        b=false;
    else
        b=true;
    for(ll i=2;b&&i*i<=n;i++)
        if(n%i==0)
            b=false;
    return(b);
}




 int main() {
     BA;
     ll t=1 ;
    //cin>>t;
     while(t--)
     {
       ll x,a=1,b;
       cin>>x;
       b=x;
      for(ll i=1;i*i<=x;i++)
      {
          if(x%i==0&&__gcd(i,x/i)==1)
          {
              if(max(i,x/i)<=max(a,b))
              {
                  a=i;
                  b=x/i;
              }
          }
      }


       cout<<a<<' '<<b<<endl;

     }


return 0;
 }